Dependency based logical form transformations
نویسندگان
چکیده
This paper describes a system developed for the transformation of English sentences into a first order logical form representation. The metho dology is centered on the use of a dependency grammar based parser . We demonstrate the suitability of applying a dependency parser based solution to the given task and in turn explain some of the limitations and challenges involved when using such an approach. The efficiencies and deficiencies of our approach are discussed as well as considerations for further enhanc e-
منابع مشابه
Transforming Dependency Structures to Logical Forms for Semantic Parsing
The strongly typed syntax of grammar formalisms such as CCG, TAG, LFG and HPSG offers a synchronous framework for deriving syntactic structures and semantic logical forms. In contrast—partly due to the lack of a strong type system—dependency structures are easy to annotate and have become a widely used form of syntactic analysis for many languages. However, the lack of a type system makes a for...
متن کاملFormally embedding existing high level synthesis algorithms
This paper introduces a general scheme for formally embedding high level synthesis by formulating its basic steps as transformations within higher order logic. A functional representation of a data ow graph is successively reened by means of generic logical transformations. Algorithms that are based on logical transformations guarantee \correctness by design". They not only construct an impleme...
متن کاملRule-based Logical Forms Extraction
In this paper, we present concise but robust rules for dependency-based logical form identification with high accuracy. We describe our approach from an intuitive and formalized perspective, which we believe overcomes much of the complexity. In comparison to previous work, we believe ours is more compact and involves less rules and exceptions. We also provide the reader with a comparison of the...
متن کاملLearning Dependency-Based Compositional Semantics
Suppose we want to build a system that answers a natural language question by representing its semantics as a logical form and computing the answer given a structured database of facts. The core part of such a system is the semantic parser that maps questions to logical forms. Semantic parsers are typically trained from examples of questions annotated with their target logical forms, but this t...
متن کاملFormal Veri cation of Transformations on Dependency Graphs in Optimizing Compilers
Dependency graphs are used as intermediate representations in optimizing compilers and software-engineering. In a transformational design approach, optimization and reenement transformations are used to transform dependency-graph-based speciications at higher abstraction levels to those at lower abstraction levels. An informal representation would lead to subtle errors, making it diicult to gua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004